Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage
نویسندگان
چکیده
منابع مشابه
Multiparty computation unconditionally secure against adversary structures
We present here a generalization of the work done by Rabin and Ben-Or in [RBO]. We give a protocol for multiparty computation which tolerates any active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional although ...
متن کاملUnconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity
We present two unconditionally secure asynchronous multiparty computation (AMPC) protocols among nparties with an amortized communication complexity of O(n) field elements per multiplication gate and whichcan tolerate a computationally unbounded active adversary corrupting t < n/4 parties. These are the first AMPCprotocols with linear communication complexity per multiplication gate...
متن کاملMultiparty computation unconditionally secure against Q^2 adversary structures
We present here a generalization of the work done by Rabin and Ben-Or in [RBO89]. We give a protocol for multiparty computation which tolerates any Q active adversary structure based on the existence of a broadcast channel, secure communication between each pair of participants, and a monotone span program with multiplication tolerating the structure. The secrecy achieved is unconditional altho...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملUnconditionally Secure Multiparty Computation and Secret Sharing
We suggest protocols for secure computation of the sum, product, and some other functions of three or more elements of an arbitrary constructible ring, without using any one-way functions. A new input that we offer here is that, in contrast with other proposals, we conceal “intermediate results” of a computation, i.e., we do not let any party accumulate functions of other parties’ private numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2021
ISSN: ['0933-2790', '1432-1378']
DOI: https://doi.org/10.1007/s00145-021-09412-0